New techniques for bounding stabilizer rank

Bounding Techniques

• Some bounding techniques are investigated in this section in order to serve as a tool for the analysis that follows. We first state the union upper bound that is widely used in the literature. • Then, some better bounds which are applicable to AWGN channels are also discussed here; they are Gallager bound and sphere upper bound.

Robust Techniques for Designing Power System Stabilizer

This paper introduces an analysis of the phenomena of stability of synchronous machines under small perturbations by examining the case of a single machine connected to a large system through external impedance, and uses robust control H∞ techniques to design stabilizer for electric power system. H techniques that are used are H -optimal controller synthesis, H mixed sensitivity controller synt...

Bounding the CP-rank by graph parameters

The cp-rank of a graph G, cpr(G), is the maximum cp-rank of a completely positive matrix with graph G. One obvious lower bound on cpr(G) is the (edge-) clique covering number, cc(G), i.e., the minimal number of cliques needed to cover all of G’s edges. It is shown here that for a connected graph G, cpr(G) = cc(G) if and only if G is triangle free and not a tree. Another lower bound for cpr(G) i...

New Bounding Techniques for Channel Codes over Quasi - Static Fading Channels

New Bounding Techniques for Channel Codes over Quasi-static Fading Channels. (August 2003) Jingyu Hu, B.E., Shanghai Jiao Tong University, P.R.China Chair of Advisory Committee: Dr. Scott L. Miller This thesis is intended to provide several new bounding techniques for channel codes over quasi-static fading channels (QSFC). This type of channel has drawn more and more attention recently with the...

New bounding techniques for goal-oriented error estimation applied to linear problems